Logistics Optimization: Vehicle Routing with Loading Constraints
نویسندگان
چکیده
In today’s global markets, enterprises are integrated in order to produce value for the end customers: this network is referred as Supply Chain (SC). Transportation Management (TM) is one of the SC processes. TM decisions include, among others, load planning (referred as Container Loading Problem CLP) and delivery route planning (referred as Vehicle Routing Problem VRP). Several authors addressed the delivery optimization which is known ad the. The loading optimization has also been widely studied and is known as the. However, very few papers have dealt with integrated approaches for loading and routing. This paper aiming at providing a link between the two problems. As first, a brief overview of SC and its management are provided, including TM, VRP and CLP issues. Then the developed heuristics for VRP with loading constraints, based on Simulated Annealing, will be introduced and, finally, a solution example will be provided.
منابع مشابه
The Vehicle Routing Problem with Simultaneous Pick-ups and Deliveries and Two-Dimensional Loading Constraints
We introduce and solve the Vehicle Routing Problem with Simultaneous Pick-ups and Deliveries and TwoDimensional Loading Constraints (2L-SPD). The 2L-SPD model covers cases where customers raise delivery and pick-up requests for transporting non-stackable rectangular items. 2L-SPD belongs to the class of composite routing-packing optimization problems. However, it is the first such problem to co...
متن کاملA hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints
This paper addresses a Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) which combines a three-dimensional loading problem and vehicle routing problem in distribution logistics. The problem requires the combinatorial optimization of a feasible loading solution and a successive routing of vehicles to satisfy client demands, where all vehicles must start and terminate at a ...
متن کاملState of the art of vehicle routing problems with loading constraints
The most studied combinatorial optimization problem in transport and logistics is the vehicle routing problem (VRP). The goal of the vehicle routing problem is to nd a set of routes for a eet of vehicles which optimises the objective function (e.g. total distance, routing costs). Every demand needs to be ful lled and vehicle capacities need to be respected. Many solution methods exist for the '...
متن کاملAnt colony optimization for the two-dimensional loading vehicle routing problem
In this paper a combination of the two most important problems in distribution logistics is considered, known as the two-dimensional loading vehicle routing problem. This problem combines the loading of the freight into the vehicles, and the successive routing of the vehicles along the road network, with the aim of satisfying the demands of the customers. The problem is solved by different heur...
متن کاملA Multi-Objective Optimization Model for Split Pollution Routing Problem with Controlled Indoor Activities in Cross Docking under Uncertainty
Cross docking is a logistics strategy that strives to reduce inventory holding costs, shipping costs, and delays in delivering the products. In this research, an optimization model is presented for split loading and unloading products by suppliers and customers, vehicle routing with fuzzy possibilistic time window constraints among them, assignment of vehicles to cross dock, consolidation and i...
متن کامل